Genetic Algorithms for a Job-Shop Scheduling Problem.
نویسندگان
چکیده
منابع مشابه
Genetic Algorithms for Job-Shop Scheduling Problems
The n×m minimum-makespan general job-shop scheduling problem, hereafter referred to as the JSSP, can be described by a set of n jobs {Ji}1≤j≤n which is to be processed on a set of m machines {Mr}1≤r≤m. Each job has a technological sequence of machines to be processed. The processing of job Jj on machine Mr is called the operation Ojr. Operation Ojr requires the exclusive use of Mr for an uninte...
متن کاملJob shop scheduling problem with alternative machines using genetic algorithms
The classical job shop scheduling problem (JSP) is the most popular machine scheduling model in practice and is known as NP-hard. The formulation of the JSP is based on the assumption that for each part type or job there is only one process plan that prescribes the sequence of operations and the machine on which each operation has to be performed. However, JSP with alternative machines for vari...
متن کاملSolving the Job Shop Scheduling Problem Using Parallel Genetic Algorithms
Extended Abstract The purpose of this paper is to present a thorough empirical analysis regarding the robustness, effectiveness and efficiency of four distinct genetic algorithm templates on the well known Job Shop Scheduling Problem (JSSP). Its popularity has maintained this combinatorial problem in the academic foray for the past five decades attracting researchers from the fields of combinat...
متن کاملHybrid algorithms for Job shop Scheduling Problem with Lot streaming and A Parallel Assembly Stage
In this paper, a Job shop scheduling problem with a parallel assembly stage and Lot Streaming (LS) is considered for the first time in both machining and assembly stages. Lot Streaming technique is a process of splitting jobs into smaller sub-jobs such that successive operations can be overlapped. Hence, to solve job shop scheduling problem with a parallel assembly stage and lot streaming, deci...
متن کاملAn Overview of Genetic Algorithms for Job Shop Scheduling Problems
This paper reviews modern genetic algorithm based approaches for solving job shop scheduling problems Genetic algorithms represent one of the most popular and mostly used metaheuristic methods applied for solving many optimization problems within last few decades. Job shop scheduling represents one of the hardest combinatorial optimization problems where number of possible schedules drastically...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: KAGAKU KOGAKU RONBUNSHU
سال: 1997
ISSN: 0386-216X,1349-9203
DOI: 10.1252/kakoronbunshu.23.175